On the Approximation of Unbounded Convex Sets by Polyhedra

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there an abundance literature investigating this task for compact sets, results on case are scarce. We first point out connections between existing before introducing a new notion polyhedral called ($\varepsilon,\delta$)-approximation that integrates in meaningful way. Some basic about ($\varepsilon,\delta$)- approximations proven general sets. In last section algorithm computation ($\varepsilon,\delta$)-approximations spectrahedra presented. Correctness and finiteness proven.